Disparity Map Generation from Illumination Variant Stereo Images Using Efficient Hierarchical Dynamic Programming

نویسندگان

  • Viral H. Borisagar
  • Mukesh A. Zaveri
چکیده

A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense Disparity Map Estimation Using CUMULANTS

We present a new efficient stereo algorithm addressing robust disparity estimation in the presence of the noises. Originality of this method is a dense disparity map estimation using the dynamic programming constrained by interest points and using Higher Order Statistics (HOS) (Cumulant) criteria for matching noisy images. Hierarchical scheme is used to ameliorate HOS-based correlation method. ...

متن کامل

A dense disparity map of stereo images 1

We present a new algorithm for solving the stereo vision matching problem by using dynamic programming. Edge pixels extracted from two images are matched and a dense disparity map is obtained by tilling in the spaces between two consecutive edge pixels. (~) 1997 Elsevier Science B.V.

متن کامل

hSGM: Hierarchical Pyramid Based Stereo Matching Algorithm

In this paper, we propose a variant of Semi-Global Matching, hSGM which is a hierarchical pyramid based dense stereo matching algorithm. Our method aggregates the matching costs from the coarse to fine scale in multiple directions to determine the optimal disparity for each pixel. It has several advantages over the original SGM: a low space complexity and efficient implementation on GPU. We sho...

متن کامل

Using Mutual Information in a Wavelet Based Hierarchical Approach to Solve Stereo Correspondence Problem

In this work, we propose a wavelet-based hierarchical approach using mutual information (MI) to solve the correspondence problem in stereo vision. The correspondence problem involves identifying corresponding pixels between images of a given stereo pair. This results in a disparity map which is required to extract depth information of the relevant scene. Until recently, mostly correlation-based...

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 2014  شماره 

صفحات  -

تاریخ انتشار 2014